منابع مشابه
VLGD, Algorithm for Drawing Very Large Graphs
Given a large planar graph we want to display it in a meaningful fashion. We present VLGD: a new, straightforward and fast algorithm for automatic display of very large planar graphs. We recursively divide the graph in pieces of roughly equal size. As a result we get a collection of O(logn) layers, where n is the number of vertices in the graph. Each succeeding layer represents the graph in an ...
متن کاملScalable Reachability Indexing for Very Large Graphs
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xi
متن کاملVisualizing Very Large Graphs Using Clustering Neighborhoods
This paper presents a method for visualization of large graphs in a two-dimensional space, such as a collection of Web pages. The main contribution here is in the representation change to enable better handling of the data. The idea of the method consists from three major steps: (1) First, we transform a graph into a sparse matrix, where for each vertex in the graph there is one sparse vector i...
متن کاملNicheWorks - Interactive Visualization of Very Large Graphs
The difference between displaying networks with 100–1,000 nodes and displaying ones with 10,000–100,000 nodes is not merely quantitative, it is qualitative. Layout algorithms suitable for the former are too slow for the latter, requiring new algorithms or modified (often relaxed) versions of existing algorithms to be invented. The density of nodes and edges displayed per inch of screen real est...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Current Developments in Mathematics
سال: 2008
ISSN: 1089-6384,2164-4829
DOI: 10.4310/cdm.2008.v2008.n1.a2